"""
728. Self Dividing Numbers

A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

Example 1:
    Input:
    left = 1, right = 22
    Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
    Note:

    The boundaries of each input argument are 1 <= left <= right <= 10000.
"""


class Solution(object):
    @staticmethod
    def is_self_dividing_number(num):
        if num < 10:
            return True

        result = True
        n = num
        while num > 0:
            x = num % 10
            num = num // 10

            if x != 0 and n % x == 0 and result:
                result = True
            else:
                result = False
                break

        return result

    def selfDividingNumbers(self, left, right):
        """
        :type left: int
        :type right: int
        :rtype: List[int]
        """
        result = []
        i = left
        while i <= right:
            if self.is_self_dividing_number(i):
                result.append(i)
            i += 1

        return result


if __name__ == '__main__':
    print(Solution().selfDividingNumbers(1, 22))
